UMP-MG: A Uni-directed Message-Passing Multi-label Generation Model for Hierarchical Text Classification

نویسندگان

چکیده

Abstract Hierarchical Text Classification (HTC) is a formidable task which involves classifying textual descriptions into taxonomic hierarchy. Existing methods, however, have difficulty in adequately modeling the hierarchical label structures, because they tend to focus on employing graph embedding methods encode structure while disregarding fact that HTC labels are rooted tree structure. This significant because, unlike graph, inherently has directive ordains information flow from one node another—a critical factor when applying task. But structure, message-passing undirected, will lead imbalance of message transmission between nodes applied HTC. To this end, we propose unidirectional multi-label generation model for HTC, referred as UMP-MG. Instead viewing classification problem previous done, novel approach conceptualizes it sequence task, introducing prior during decoding process. further enables blocking direction ensure method better suited and thus resulted enhanced representation. Results obtained through experimentation both public WOS dataset an E-commerce user intent demonstrate our proposed can achieve superlative results.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Model for Hierarchical Multi-Label Text Classification

The main challenge in hierarchical multilabel text classification is how to leverage hierarchically organized labels. In this paper, we propose to exploit dependencies among multiple labels to be output, which has been left unused in previous studies. To do this, we first formalize this task as a structured prediction problem and propose (1) a global model that jointly outputs multiple labels a...

متن کامل

Initializing neural networks for hierarchical multi-label text classification

Many tasks in the biomedical domain require the assignment of one or more predefined labels to input text, where the labels are a part of a hierarchical structure (such as a taxonomy). The conventional approach is to use a one-vs.-rest (OVR) classification setup, where a binary classifier is trained for each label in the taxonomy or ontology where all instances not belonging to the class are co...

متن کامل

Multi-label Hierarchical Text Classification using the ACM Taxonomy

Many of the works of text classification involve the attribution of each text a single class label from a predefined set of classes, usually small and flat organized (flat classification). However, there are more complex classification problems in which we can assign to each text more than one class (multi-label classification), that can be organized in a hierarchical structure (hierarchical cl...

متن کامل

Multi Label Text Classification through Label Propagation

Classifying text data has been an active area of research for a long time. Text document is multifaceted object and often inherently ambiguous by nature. Multi-label learning deals with such ambiguous object. Classification of such ambiguous text objects often makes task of classifier difficult while assigning relevant classes to input document. Traditional single label and multi class text cla...

متن کامل

Extending ReliefF for Hierarchical Multi-label Classification

In the recent years, the data available for analysis in machine learning is becoming very high-dimensional and also structured in a more complex way. This emphasises the need for developing machine learning algorithms that are able to tackle both the high-dimensionality and the complex structure of the data. Our work in this paper, focuses on extending a feature ranking algorithm that can be us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Data Science and Engineering

سال: 2023

ISSN: ['2364-1541', '2364-1185']

DOI: https://doi.org/10.1007/s41019-023-00210-1